Robust Vertex Classification

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...

متن کامل

Vertex Classification for Segmented Images

Depth estimation is an essential component for scene understanding. With this in mind, we take a novel approach to 3D depth reconstruction which leverages off of the highly structured nature of our environment. We believe that high level structural cues, such as planes, edges, and vertices play an important role in resolving depth ambiguities and attempt to evaluate the significance of such fac...

متن کامل

Classification of Vertex-transitive Structures

When one thinks of objects with a significant level of symmetry it is natural to expect there to be a simple classification. However, this leads to an interesting problem in that research has revealed the existence of highly symmetric objects which are very complex when considered within the framework of Borel complexity. The tension between these two seemingly contradictory notions leads to a ...

متن کامل

Robust 3D Watermarking Using Vertex Smoothness Measure

Watermarking of 3D data has gathered renewed interest due to the explosion of graphic content and animated motion movies. This paper discusses non-blind watermarking of 3D models in the spatial domain. The proposed method estimates the local smoothness variation of the mesh to select vertices for inserting a watermark. Smoothness variation of the surface represented by the 1ring neighborhood of...

متن کامل

Classification of vertex-transitive cubic partial cubes

Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: K2ƒC2n, for some n ≥ 2, generalized Petersen graph G(10, 3), permutahedron, truncated cuboctahedron, or truncated icosidodecahedron. This complete classification of cubic, vertex-transitive partial cubes, a f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 2016

ISSN: 0162-8828,2160-9292

DOI: 10.1109/tpami.2015.2456913